equi-bipartite graphs by monochromatic trees under a color degree condition
نویسنده
چکیده
The monochromatic tree partition number of an r-edge-colored graph G, denoted by tr(G), is the minimum integer k such that whenever the edges of G are colored with r colors, the vertices of G can be covered by at most k vertex-disjoint monochromatic trees. In general, to determine this number is very difficult. For 2-edge-colored complete multipartite graph, Kaneko, Kano, and Suzuki gave the exact value of t2(K(n1, n2, · · · , nk)). In this paper, we prove that if n ≥ 3, and K(n, n) is 3-edge-colored such that every vertex has color degree 3, then t3(K(n, n)) = 3.
منابع مشابه
Partitioning 3-Edge-Colored Complete Equi-Bipartite Graphs by Monochromatic Trees under a Color Degree Condition
The monochromatic tree partition number of an r-edge-colored graph G, denoted by tr(G), is the minimum integer k such that whenever the edges of G are colored with r colors, the vertices of G can be covered by at most k vertex-disjoint monochromatic trees. In general, to determine this number is very difficult. For 2edge-colored complete multipartite graph, Kaneko, Kano, and Suzuki gave the exa...
متن کاملBalanced Degree-Magic Labelings of Complete Bipartite Graphs under Binary Operations
A graph is called supermagic if there is a labeling of edges where the edges are labeled with consecutive distinct positive integers such that the sum of the labels of all edges incident with any vertex is constant. A graph G is called degree-magic if there is a labeling of the edges by integers 1, 2, ..., |E(G)| such that the sum of the labels of the edges incident with any vertex v is equal t...
متن کاملDegree Ramsey numbers for cycles and blowups of trees
Let H s → G mean that every s-coloring of E(H) produces a monochromatic copy of G in some color class. Let the s-color degree Ramsey number of a graph G, written R∆(G; s), be min{∆(H) : H s → G}. We prove that the 2-color degree Ramsey number is at most 96 for every even cycle and at most 3458 for every odd cycle. For the general s-color problem on even cycles, we prove R∆(C2m; s) ≤ 16s6 for al...
متن کاملBipartite Ramsey numbers involving stars, stripes and trees
The Ramsey number R(m,n) is the smallest integer p such that any blue-red colouring of the edges of the complete graph Kp forces the appearance of a blue Km or a red Kn. Bipartite Ramsey problems deal with the same questions but the graph explored is the complete bipartite graph instead of the complete graph. We investigate the appearance of simpler monochromatic graphs such as stripes, stars a...
متن کاملOn the Ramsey Numbers for Bipartite Multigraphs
A coloring of a complete bipartite graph is shuffle-preserved if it is the case that assigning a color c to edges (u, v) and (u′, v′) enforces the same color assignment for edges (u, v′) and (u′, v). (In words, the induced subgraph with respect to color c is complete.) In this paper, we investigate a variant of the Ramsey problem for the class of complete bipartite multigraphs. (By a multigraph...
متن کامل